SINA: Semantic interpretation of user queries for question answering on interlinked data

The architectural choices underlying Linked Data have led to a compendium of data sources which contain both duplicated and fragmented information on a large number of domains. One way to enable non-experts users to access this data compendium is to provide keyword search frameworks that can capitalize on the inherent characteristics of Linked Data. Developing such systems is challenging for three main reasons. First, resources across different datasets or even within the same dataset can be homonyms. Second, different datasets employ heterogeneous schemas and each one may only contain a part of the answer for a certain user query. Finally, constructing a federated formal query from keywords across different datasets requires exploiting links between the different datasets on both the schema and instance levels. We present Sina, a scalable keyword search system that can answer user queries by transforming user-supplied keywords or natural-languages queries into conjunctive SPARQL queries over a set of interlinked data sources. Sina uses a hidden Markov model to determine the most suitable resources for a user-supplied query from different datasets. Moreover, our framework is able to construct federated queries by using the disambiguated resources and leveraging the link structure underlying the datasets to query. We evaluate Sina over three different datasets. We can answer 25 queries from the QALD-1 correctly. Moreover, we perform as well as the best question answering system from the QALD-3 competition by answering 32 questions correctly while also being able to answer queries on distributed sources. We study the runtime of SINA in its mono-core and parallel implementations and draw preliminary conclusions on the scalability of keyword search on Linked Data.     

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.     

A synergistic strategy for combining thesaurus-based and corpus-based approaches in building ontology for multilingual search engines

In this article we illustrate a methodology for building cross-language search engine. A synergistic approach between thesaurus-based approach and corpus-based approach is proposed. First, a bilingual ontology thesaurus is designed with respect to two languages: English and Spanish, where a simple bilingual listing of terms, phrases, concepts, and subconcepts is built. Second, term vector translation is used – a statistical multilingual text retrieval techniques that maps statistical information about term use between languages (Ontology co-learning). These techniques map sets of t f id f term weights from one language to another. We also applied a query translation method to retrieve multilingual documents with an expansion technique for phrasal translation. Finally, we present our findings.     

Failure load prediction and optimisation for adhesively bonded joints enabled by deep learning and fruit fly optimisation

Adhesively bonded joints have been extensively employed in the aeronautical and automotive industries to join thin-layer materials for developing lightweight components. To strengthen the structural integrity of joints, it is critical to estimate and improve joint failure loads effectually. To accomplish the aforementioned purpose, this paper presents a novel deep neural network (DNN) model-enabled approach, and a single lap joint (SLJ) design is used to support research development and validation. The approach is innovative in the following aspects: (i) the DNN model is reinforced with a transfer learning (TL) mechanism to realise an adaptive prediction on a new SLJ design, and the requirement to re-create new training samples and re-train the DNN model from scratch for the design can be alleviated; (ii) a fruit fly optimisation (FFO) algorithm featured with the parallel computing capability is incorporated into the approach to efficiently optimise joint parameters based on joint failure load predictions. Case studies were developed to validate the effectiveness of the approach. Experimental results demonstrate that, with this approach, the number of datasets and the computational time required to re-train the DNN model for a new SLJ design were significantly reduced by 92.00% and 99.57% respectively, and the joint failure load was substantially increased by 9.96%.     

Specification uncertainty in modeling internet adoption: A developing city case analysis

Internet adoption fosters economic growth and development. Specifying policy control drivers is particularly relevant for developing countries. However, there is no consensus on the most relevant variables. We explored 33.6 million potential models to identify the most important determinants of household internet adoption using stochastic search variable selection and socioeconomic data from Medellín, Colombia. We found that monthly income, the head of household education and voting, and having a computer and cable television at home are the most relevant variables.     

Enriching Context Information for Entity Linking with Web Data

Journal of Computer Science and Technology - Entity linking (EL) is the task of determining the identity of textual entity mentions given a predefined knowledge base (KB). Plenty of existing...     

DEM: Deep Entity Matching Across Heterogeneous Information Networks

Heterogeneous information networks, which consist of multi-typed vertices representing objects and multi-typed edges representing relations between objects, are ubiquitous in the real world. In this paper, we study the problem of entity matching for heterogeneous information networks based on distributed network embedding and multi-layer perceptron with a highway network, and we propose a new method named DEM short for Deep Entity Matching. In contrast to the traditional entity matching methods, DEM utilizes the multi-layer perceptron with a highway network to explore the hidden relations to improve the performance of matching. Importantly, we incorporate DEM with the network embedding methodology, enabling highly efficient computing in a vectorized manner. DEM’s generic modeling of both the network structure and the entity attributes enables it to model various heterogeneous information networks flexibly. To illustrate its functionality, we apply the DEM algorithm to two real-world entity matching applications: user linkage under the social network analysis scenario that predicts the same or matched users in different social platforms and record linkage that predicts the same or matched records in different citation networks. Extensive experiments on real-world datasets demonstrate DEM’s effectiveness and rationality.

     

遗传算法和模矢法结合的概率积分法参数反演方法

遗传算法在反演概率积分法预计参数时从参数取值范围内的串集开始搜索,并使用弹性策略来维持群体的多样性,使得算法可以跨过局部收敛的障碍,向全局最优解方向进化;但这种概率化的寻优算法存在局部探索能力差、结果不稳定的缺陷,只能获得问题的近似最优解。模矢法是一种降梯度算法,算法局部探索能力强、收敛快;但这种算法对初值选取敏感,初值选择不当易陷入局部极值。本文提出并实现了一种模矢法与遗传算法结合的组合算法:先使用遗传算法求得参数的全局近似最优解,然后将近似最优解作为探索初值,使用模矢法获得参数的稳定、精确最优解。研究结果表明:组合算法反演概率积分法预计参数的精确度高、收敛快、稳定性好,综合性能较遗传算法和模矢法有明显优势。     

Data-efficient learning of robotic clothing assistance using Bayesian Gaussian process latent variable model

ABSTRACT

Motor-skill learning for complex robotic tasks is a challenging problem due to the high task variability. Robotic clothing assistance is one such challenging problem that can greatly improve the quality-of-life for the elderly and disabled. In this study, we propose a data-efficient representation to encode task-specific motor-skills of the robot using Bayesian nonparametric latent variable models. The effectivity of the proposed motor-skill representation is demonstrated in two ways: (1) through a real-time controller that can be used as a tool for learning from demonstration to impart novel skills to the robot and (2) by demonstrating that policy search reinforcement learning in such a task-specific latent space outperforms learning in the high-dimensional joint configuration space of the robot. We implement our proposed framework in a practical setting with a dual-arm robot performing clothing assistance tasks.